Markovian Queue with Garbage Collection
نویسندگان
چکیده
Garbage collection is a fundamental component of memory management in several software frameworks. We present a general twodimensional Markovian model of a queue with garbage collection where the input process is Markov-modulated and the memory consumption can be modeled with discretisation. We derive important performance measures (also including garbage collection-related measures like mean garbage collection cycle length). The model is validated via measurements from a real-life data processing pipeline.
منابع مشابه
ANALYSIS OF FINITE BUFFER RENEWAL INPUT QUEUE WITH BALKING AND MARKOVIAN SERVICE PROCESS
This paper presents the analysis of a renewal input finite buffer queue wherein the customers can decide either to join the queue with a probability or balk. The service process is Markovian service process ($MSP$) governed by an underlying $m$-state Markov chain. Employing the supplementary variable and imbedded Markov chain techniques, the steady-state system length distributions at pre...
متن کاملQueue with Heterogeneous Server Under Resequencing Constraint
In this paper, a markovian queue with two types of servers and buffer space is considered. The resequencing constraint is imposed according to which the customers leave the system in the same order in which they entered it. For finite buffer queue, the steady state queue size distribution has been obtained.?
متن کاملSampling-based Metadata Management for Flash Storage
Existing garbage collection algorithms for the flashbased storage use score-based heuristics to select victim blocks for reclaiming free space and wear leveling. The score for a block is estimated using metadata information such as age, utilization, and erase count. To quickly find a victim block, these algorithms need to maintain a priority queue in the SRAM of a flashbased storage controller....
متن کاملAnalyses of a Markovian queue with two heterogeneous servers and working vacation
This paper analyzes an M/M/2 queueing system with two heterogeneous servers. Both servers goes on vacation when there is no customers waiting for service after this server 1 is always available but the other goes on vacation whenever server 2 is idle. The vacationing server however, returns to serve at a low rate as an arrival finds the other server busy. The system is analyzed in the steady st...
متن کاملA multi-processor shared memory architecture for parallel cyclic reference counting
Counting with Lazy Mark-Scan [7]. There are two processors P 1 and P 2 , which will perform graph rewriting and garbage collection simultaneously. Both processors share the same memory area, the working space which is organised as a heap of cells. We assume that the mutator will never point at a garbage node. However, by changing edges the mutator can turn reachable nodes into garbage. In case ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2017